SiCp/Y112铝基复合材料制备工艺及性能

3种不同铸造工艺条件下铝基复合材料的微观组织,并对其硬度进行了测定.研究表明:与全液态铸造法和半固态铸造法相比,搅熔铸造制备的SiCp/Y112铝基复合材料,其增强相SiC颗粒分布均匀,气孔率较少.是一种较理想的金属基复合材料制备工艺.未增强的Y112基体铝合金的维氏硬度高于其半固态坯料的维氏硬度;而SiCp/Y112铝基复合材料的维氏硬度明显高于基体的维氏硬度,并随着SiC颗粒的体积分数的增加其复合材料的维氏硬度不断提高.     

单调和Fuzzy单调变分不等式的补偿方法

在实自反Banach空间,用补偿方法研究单调和Fuzzy单调广义非线性变分不等式,得到了几个解的存在性定理.改进和推广了Browder,Pascali-Sburlan,Zhang等人的各种结果.     

Critical percolation exploration path and SLE 6: a proof of convergence

It was argued by Schramm and Smirnov that the critical site percolation exploration path on the triangular lattice converges in distribution to the trace of chordal SLE ₆. We provide here a detailed proof, which relies on Smirnov’s theorem that crossing probabilities have a conformally invariant scaling limit (given by Cardy’s formula). The version of convergence to SLE ₆ that we prove suffices for the Smirnov–Werner derivation of certain critical percolation crossing exponents and for our analysis of the critical percolation full scaling limit as a process of continuum nonsimple loops. Research of Charles M.Newman was partially supported by the US NSF under grants DMS-01-04278 and DMS-06-06696.     

Irn(n=2-25)团簇基态结构的遗传算法研究

用遗传算法结合Gupta紧束缚模型势研究了Irn(n=2-25)团簇的基态结构.分析了Irn(n=2-25)团簇的基态结构随团簇尺寸的变化规律.计算结果表明,Irn(n=2-25)团簇的每个原子的平均束缚能和平均第一近邻随团簇尺寸的增加而增大,以总束缚能的二阶差分为判据,Irn(n=2-25)团簇的幻数是4、7、9、13、15、19、23.     

正丁基苝四羧酸二酰亚胺的晶型和性能研究

文章合成了N,N'-二正丁基苝四羧酸二酰亚胺,并纯化、调晶,进行了IR、元素分析、X射线等测定.分析该化合物在DMF中的紫外光谱(最大吸收波长524.80 nm)、荧光光谱(最大发射波长539.0 nm)、Stokes位移(数值15 nm)等光谱性质.在400～700 nm范围内,α晶型薄膜紫外-可见吸收出现很强的吸收峰,且由β型变为α型,最大吸收波长有明显的红移(545 nm变为580 nm).X射线粉末衍射也反映出α晶型的2θ在26.0°处衍射峰CPS为2 508,β型在25.2°为1 891.α,β晶型作为电荷产生材料制得的功能分离型有机光导体,在光源滤波波长λ=532 nm曝光下,测得含α,β感光体达到饱和电位的时间分别为46,93.98 s,光衰电位(5.3千伏电压负充电电晕,1～2 s后的表面电位)分别为727和525 V,半衰曝光量分别为4.32,4.34μJ·cm-2,残余电位分别为30和45 V等光导性能数值.     

Beyond Cartesian limits: Leibniz's passage from algebraic to “transcendental” mathematics

This article deals with Leibniz's reception of Descartes' “geometry.” Leibnizian mathematics was based on five fundamental notions: calculus, characteristic, art of invention, method, and freedom. On the basis of methodological considerations Leibniz criticized Descartes' restriction of geometry to objects that could be given in terms of algebraic (i.e., finite) equations: “Descartes's mind was the limit of science.” The failure of algebra to solve equations of higher degree led Leibniz to develop linear algebra, and the failure of algebra to deal with transcendental problems led him to conceive of a science of the infinite. Hence Leibniz reconstructed the mathematical corpus, created new (transcendental) notions, and redefined known notions (equality, exactness, construction), thus establishing “a veritable complement of algebra for the transcendentals”: infinite equations, i.e., infinite series, became inestimable tools of mathematical research.     

Persistence and stability for a two-species ratio-dependent predator-prey system with distributed time delay

A two-species ratio-dependent predator-prey model with distributed time delay is investigated. It is shown that the system is persistent under some appropriate conditions, and sufficient conditions are obtained for both the local and global stability of the positive equilibrium of the system.     

Nonlinear Schrödinger equations with symmetric multi-polar potentials

This paper deals with a class of nonlinear elliptic equations involving a critical power-nonlinearity as well as a potential featuring multiple inverse square singularities. When the poles form a symmetric structure, it is natural we wonder how the symmetry affects such mutual interaction. The present paper means to study this aspect from the point of view of the existence of solutions inheriting the same symmetry properties as the set of singularities. Mathematics Subject Classification (2000) 35J60, 35J20, 35B33     

Lagrangean heuristics combined with reoptimization for the 0-1 bidimensional knapsack problem

First, this paper deals with lagrangean heuristics for the 0-1 bidimensional knapsack problem. A projected subgradient algorithm is performed for solving a lagrangean dual of the problem, to improve the convergence of the classical subgradient algorithm. Secondly, a local search is introduced to improve the lower bound on the value of the biknapsack produced by lagrangean heuristics. Thirdly, a variable fixing phase is embedded in the process. Finally, the sequence of 0-1 one-dimensional knapsack instances obtained from the algorithm are solved by using reoptimization techniques in order to reduce the total computational time effort. Computational results are presented.